Feasible Point Pursuit and Successive Convex Approximation for Transmit Power Minimization in SWIPT-Multigroup Multicasting Systems

We consider three wireless multi-group (MG) multicasting (MC) systems capable of handling heterogeneous user types viz., information decoding (ID) specific users with conventional receiver architectures, energy harvesting (EH) only non-linear EH module, and joint ID capabilities having separate units for the two operations, respectively. Each is categorized under unique group(s), which can be MC type specifically meant users, and/or an group consisting explicit users. The are a part both single group. formulate optimization problem to minimize total transmit power optimal precoder designs aforementioned scenarios, certain quality-of-service constraints. may adapted well-known semi-definite program solved via relaxation rank-1 constraint. However, this process leads performance degradation in some cases, increases rank solution obtained from relaxed problem. Hence, we develop novel technique motivated by feasible-point pursuit successive convex approximation method order address rank-related issue. benefits proposed illustrated various operating conditions parameter values, comparison between above-mentioned scenarios.